Bit-Wise Arithmetic Coding for Data Compression
نویسنده
چکیده
This article examines the problem of compressing a uniformly quantized IID source. We present a new compression technique, bit-wise arithmetic coding, that assigns xed length codewords to the quantizer output and uses arithmetic coding to compress the codewords, treating the codeword bits as independent. We examine the performance of this method and evaluate the overhead required when used block-adaptively. Simulation results are presented for Gaussian and Laplacian sources. This new technique could be used as the entropy coder in a transform or subband coding system.
منابع مشابه
Adaptive Heuristic Search for Soft-Input Soft-Output Decoding of Arithmetic Codes
Arithmetic coding for data compression has gained widespread acceptance for optimum compression when used in a suitable model. The "traditional" hard bit based decoding suffers from severe loss of data when errors are present in the received bitstream. In this paper, heuristic-search based algorithms are introduced for the decoding of arithmetic coded bitstreams. They utilize both channel "soft...
متن کاملBlock truncation coding with entropy coding
Block Truncation Coding (BTC) is a simple and fast image compression algorithm wich achieves constant bit rate of 2.0 bits per pixel. The method is however suboptimal. In the present paper we propose a modification of BTC in which the compression ratio will be improved by coding the quantization data and the bit plane by arithmetic coding with an adaptive modelling scheme. The results compare f...
متن کاملHardware Architecture for Simultaneous Arithmetic Coding and Encryption
Arithmetic coding is increasingly being used in upcoming image and video compression standards such as JPEG2000, and MPEG-4/H.264 AVC and SVC standards. It provides an efficient way of lossless compression and recently, it has been used for joint compression and encryption of video data. In this paper, we present an interpretation of arithmetic coding using chaotic maps. This interpretation gre...
متن کاملLossless compression catalyst based on binary allocation via modular arithmetic
A new binary (bit-level) lossless compression catalyst method based on a modular arithmetic, called Binary Allocation via Modular Arithmetic (BAMA), has been introduced in this paper. In other words, BAMA is for storage and transmission of binary sequences, digital signal, images and video, also streaming and all kinds of digital transmission. As we said, our method does not compress, but facil...
متن کاملAchieving Better Compression Applying Index-based Byte-Pair Transformation before Arithmetic Coding
Arithmetic coding is used in many compression techniques during the entropy encoding stage. Further compression is not possible without changing the data model and increasing redundancy in the data set. To increase the redundancy, we have applied index based byte-pair transformation (BPT-I) as a pre-processing to arithmetic coding. BPT-I transforms most frequent byte-pairs (2-byte integers). He...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994